Date modified: Thu 2023-05-11 . 11:51 AM
Date created: Sat 2023-10-07 . 09:02 PM
# Maximal rooks and bishops. Given an $n \times m$ chessboard $B$, it is not hard to see that there can be at most $\min(n,m)$ many rooks that you can place on $B$ where the rooks are all non-attacking each other. --- What about bishops? How many bishops can you place on an $n\times m$ chessboard $B$ so that all of them are non-attacking each other? --- Bonus question. What about knights? ///Hint./// White bishops and black bishops can never attack other. Also, when viewed in a different perspective, bishops are rooks. /// #counting #chess